Exact Upper Bounds and Their Uses in Set Theory

نویسنده

  • Menachem Kojman
چکیده

The existence of exact upper bounds for increasing sequences of ordinal functions modulo an ideal is discussed. The main theorem (Theorem 18 below) gives a necessary and sufficient condition for the existence of an exact upper bound / for a \A\~*~ is regular: an eub / with liminf/cf/(a) = /x exists if and only if for every regular K E (|^4|,/Z) the set of flat points in / of cofinality K is stationary. Two applications of the main Theorem to set theory are presented A theorem of Magidor's on covering between models of ZFC is proved using the main theorem (Theorem 22): If V C W are transitive models of set theory with uncovering and GCH holds in V, then /̂ -covering holds between V and W for all cardinals K. A new proof of a Theorem by Cummings on collapsing successors of singulars is also given (Theorem 24). The appendix to the paper contains a short proof of Shelah's trichotomy theorem, for the reaser's convenience. * Research was partially supported by an NSF grant number 9622579

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Exact Upper Bounds and Their Uses in Settheorymenachem

The existence of exact upper bounds for increasing sequences of ordinal functions modulo an ideal is discussed. The main theorem (Theorem 18 below) gives a necessary and suucient condition for the existence of an exact upper bound f for a < I-increasing sequence f = hf : < i On A where > jAj + is regular: an eub f with lim inf I cff(a) = exists if and only if for every regular 2 (jAj;) the set ...

متن کامل

Upper Bounds for Metapredicative Mahlo in Explicit Mathematics and Admissible Set Theory

In this article we introduce systems for metapredicative Mahlo in explicit mathematics and admissible set theory. The exact upper prooftheoretic bounds of these systems are established.

متن کامل

حداقل کردن تعداد کارهای دیرکرددار در مسئله دو ماشین با ورود غیر همزمان

In this paper, minimizing the number of tardy jobs in two-machine flowshop scheduling with non-simultaneous job entrance is discussed. It is proven that the complexity of the problem is NP_hard. Therefore, a heuristic algorithm is proposed to solve the large scale problems. Besides, an exact branch and bound algorithm with utilizing heuristic algorithm as upper bound proposed to achieve optimal...

متن کامل

Exact maximum coverage probabilities of confidence intervals with increasing bounds for Poisson distribution mean

 ‎A Poisson distribution is well used as a standard model for analyzing count data‎. ‎So the Poisson distribution parameter estimation is widely applied in practice‎. ‎Providing accurate confidence intervals for the discrete distribution parameters is very difficult‎. ‎So far‎, ‎many asymptotic confidence intervals for the mean of Poisson distribution is provided‎. ‎It is known that the coverag...

متن کامل

Sharp Upper bounds for Multiplicative Version of Degree Distance and Multiplicative Version of Gutman Index of Some Products of Graphs

In $1994,$ degree distance  of a graph was introduced by Dobrynin, Kochetova and Gutman. And Gutman proposed the Gutman index of a graph in $1994.$ In this paper, we introduce the concepts of  multiplicative version of degree distance and the multiplicative version of Gutman index of a graph. We find the sharp upper bound for the  multiplicative version of degree distance and multiplicative ver...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Ann. Pure Appl. Logic

دوره 92  شماره 

صفحات  -

تاریخ انتشار 1998